On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis

نویسندگان

  • Maria Paola Bonacina
  • Jieh Hsiang
چکیده

We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem proving. We outline an approach to measuring the complexity of search which can be applied to analyze and evaluate the behaviour of theorem-proving strategies. Using our framework, we compare contraction-based strategies of different contraction power and show how they affect the evolution of the respective search spaces during the derivation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the representation of parallel search in theorem proving

This extended abstract summarizes two contributions from ongoing work on parallel search in theorem proving. First, we give a framework of deenitions for parallel theorem proving, including inference system, communication operators, parallel search plan, subdivision function, parallel strategy, parallel derivation, fairness and propagation of redundancy for parallel derivations. A notion of a p...

متن کامل

Machine-independent Evaluation of Theorem-proving Strategies

The evaluation of theorem-proving strategies has been done traditionally in an empirical manner: a strategy is implemented in a theorem prover, the prover is applied to a number of theorems, and the running times are reported and compared with those of other systems. In recent years, a growing eeort has been devoted to make the evaluation of theorem provers more systematic. The need for a stand...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Strategy, Management Accounting Systems, and Performance of Iranian Petrochemical Companies in the Light of Contingency Theory

In the present business atmosphere, an organization should be able to respond to environmental needs occasioned by rapid and dynamic evolution as quickly as possible. It is obvious that such ability is impossible without a proper strategic approach, strategic thinking, and a suitable management accounting system. This study attempts to investigate the relationships between strategy, management ...

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 147  شماره 

صفحات  -

تاریخ انتشار 1998